一类非线性动力系统的时滞反馈分叉控制

对时滞控制作用下的参数激励van der Pol-Duffing方程进行了研究,着重研究了时滞参数对该类参数激励系统的1/2亚谐共振-主参数共振分叉响应控制。首先采用摄动法从理论上推导出时滞动力系统的分叉响应方程,再采用数值模拟的方法研究了时滞参数对系统分叉响应的影响。研究结果表明,适当选取时滞参数,不仅可以改变分叉响应曲线的拓扑形态,还可以平移分叉响应曲线,即使其分叉提前或滞后,还能同时满足这两种要求。     

Scheduling with centralized and decentralized batching policies in concurrent open shops

This article considers batch scheduling with centralized and decentralized decisions. The context of our study is concurrent open shop scheduling where the jobs are to be processed on a set of independent dedicated machines, which process designated operations of the jobs in batches. The batching policy across the machines can be centralized or decentralized. We study such scheduling problems with the objectives of minimizing the maximum lateness, weighted number of tardy jobs, and total weighted completion time, when the job sequence is determined in advance. We present polynomial time dynamic programming algorithms for some cases of these problems and pseudo‐polynomial time algorithms for some problems that are NP‐hard in the ordinary sense. © 2010 Wiley Periodicals, Inc. Naval Research Logistics 58: 17–27, 2011     

一类脉冲时滞抛物型方程解的振动准则

讨论了一类含脉冲的时滞抛物型方程解的振动性,利用格林公式以及Jensen不等式,得出了该方程在一类边界条件下解的振动准则。     

Using stochastic programming to solve an outpatient appointment scheduling problem with random service and arrival times

We study a stochastic outpatient appointment scheduling problem (SOASP) in which we need to design a schedule and an adaptive rescheduling (i.e., resequencing or declining) policy for a set of patients. Each patient has a known type and associated probability distributions of random service duration and random arrival time. Finding a provably optimal solution to this problem requires solving a multistage stochastic mixed‐integer program (MSMIP) with a schedule optimization problem solved at each stage, determining the optimal rescheduling policy over the various random service durations and arrival times. In recognition that this MSMIP is intractable, we first consider a two‐stage model (TSM) that relaxes the nonanticipativity constraints of MSMIP and so yields a lower bound. Second, we derive a set of valid inequalities to strengthen and improve the solvability of the TSM formulation. Third, we obtain an upper bound for the MSMIP by solving the TSM under the feasible (and easily implementable) appointment order (AO) policy, which requires that patients are served in the order of their scheduled appointments, independent of their actual arrival times. Fourth, we propose a Monte Carlo approach to evaluate the relative gap between the MSMIP upper and lower bounds. Finally, in a series of numerical experiments, we show that these two bounds are very close in a wide range of SOASP instances, demonstrating the near‐optimality of the AO policy. We also identify parameter settings that result in a large gap in between these two bounds. Accordingly, we propose an alternative policy based on neighbor‐swapping. We demonstrate that this alternative policy leads to a much tighter upper bound and significantly shrinks the gap.     

A novel formulation of material nonlinear analysis in structural mechanics

This article demonstrates a novel approach for material nonlinear analysis. This analysis procedure eliminates tedious and lengthy step by step incremental and then iterative procedure adopted classically and gives direct results in the linear as well as in nonlinear range of the material behavior. Use of elastic moduli is eliminated. Instead, stress and strain functions are used as the material input in the analysis procedure. These stress and strain functions are directly derived from the stress-strain behavior of the material by the method of curve fitting. This way, the whole stress-strain diagram is utilized in the analysis which naturally exposes the response of structure when loading is in nonlinear range of the material behavior. It is found that it is an excellent computational procedure adopted so far for material nonlinear analysis which gives very accurate results, easy to adopt and simple in calculations. The method eliminates all types of linearity assumptions in basic derivations of equations and hence, eliminates all types of possibility of errors in the analysis procedure as well. As it is required to know stress distribution in the structural body by proper modelling and structural idealization, the proposed analysis approach can be regarded as stress-based analysis procedure. Basic problems such as uniaxial problem, beam bending, and torsion problems are solved. It is found that approach is very suitable for solving the problems of fracture mechanics. Energy release rate for plate with center crack and double cantilever beam specimen is also evaluated. The approach solves the fracture problem with relative ease in strength of material style calculations. For all problems, results are compared with the classical displacement-based liner theory.     

坦克稳定器的神经滑模控制方法

针对坦克稳定器这一类非线性和不确定性的复杂控制对象,提出一种神经滑模控制方法。该方法将滑模控制与神经网络相结合,解决了控制系统跟踪性能和鲁棒性能之间的矛盾。系统中的滑模控制器保证了系统的快速跟踪性能;而神经网络具有很强的自学习功能,通过学习能够保证系统的稳定性,同时可对扰动和参数变化进行有效的抑制补偿,从而在不牺牲系统鲁棒性的同时达到削弱抖振的目的。从理论上证明了滑动平面的稳定性,并且通过仿真验证了该结果。仿真结果表明该设计方法优于经典设计,为实际设计提供了一种可行的新方法。     

利用混合编程改善SMP机群上并行矩阵乘法的性能

针对SMP机群,探讨了分别利用单机优化、OpenMP与MPI从指令级、共享存储级与分布主存级三个层次上改善矩阵并行乘Fox算法性能的方法。并通过调用数学函数库与混合编程的方式,在深腾6800上进行了实验,取得了相当满意的数值效果。     

卫星任务调度问题的约束规划模型

卫星任务规划与调度是空间资源管理的重要内容之一,其目的在于为卫星系统的任务计划编制提供科学合理的决策手段与依据。卫星任务调度问题的重要特点在于,调度任务存在可见时间窗口约束。只有在可见时间窗口内,调度任务才可能执行并完成。在进行合理假设的基础上,建立卫星任务调度问题的约束规划模型。对基本禁忌搜索算法进行改进,提出了模型求解的变邻域禁忌搜索算法。应用结果表明,约束规划模型的建立与求解是合理的。     

面向对象的反舰导弹航路规划

针对反舰导弹航路规划的任务特点,提出了一种面向对象的反舰导弹航路规划方法.在全面分析了反舰导弹航路规划中可能用到的类的基础上,建立了对各种类的描述,使得不同算法和不同任务要求的航路规划可以通过对类的继承和对成员函数的重载实现.最后,在VC 平台下,对这种面向对象的反舰导弹航路规划方法进行了编程实验.     

基于小波网络的非线性系统辨识研究

小波网络为非线性系统辨识研究提供了一种有效的方法,但目前用于小波网络学习的进化算法易陷入局部极小等缺陷.结合生物免疫系统的概念和理论,在非线性系统辨识中引入基于免疫算法的小波网络.该算法中抗体通过浓度相互作用的机制来促进或抑制抗体的生成,借此保持抗体的多样性,并产生了高亲和力的抗体对种群进行不断的更新,提高了算法的全局搜索能力和收敛速度.最后,把基于免疫算法的小波网络用于一个非线性系统辨识的标准实例中,仿真结果验证了该算法的有效性.